An Application of Stochastic Context Sensitive Grammar Induction to Transfer Learning
نویسنده
چکیده
We generalize Solomonoff’s stochastic context-free grammar induction method to context-sensitive grammars, and apply it to transfer learning problem by means of an efficient update algorithm. The stochastic grammar serves as a guiding program distribution which improves future probabilistic induction approximations by learning about the training sequence of problems. Stochastic grammar is updated via extrapolating from the initial grammar and the solution corpus. We introduce a data structure to represent derivations and introduce efficient algorithms to compute an updated grammar which modify production probabilities and add new productions that represent past solutions.
منابع مشابه
Learning Classifier System Approach to Natural Language Grammar Induction
This paper describes an evolutionary approach to the problem of inferring non-stochastic context-free grammar (CFG) from natural language (NL) corpora. The approach employs Grammar-based Classifier System (GCS). GCS is a new version of Learning Classifier Systems in which classifiers are represented by CFG in Chomsky Normal Form. GCS has been tested on the NL corpora, and it provided comparable...
متن کاملLearning Stochastic Context-Free Grammars from Corpora Using a Genetic Algorithm
A genetic algorithm for inferring stochastic context-free grammars from nite language samples is described. Solutions to the inference problem are evolved by optimizing the parameters of a covering grammar for a given language sample. We describe a number of experiments in learning grammars for a range of formal languages. The results of these experiments are encouraging and compare very favour...
متن کاملStochastic Context-Free Grammar Induction with a Genetic Algorithm Using Local Search
We have previously used grammars as a formalism to structure a GA's search for program called sorting networks (SNets) [KBW95]. In this paper we restrict ourselves to stochastic context-free grammars which, while more analytically tracxtable than our SNet grammars, are more difficult than others previously considered by the GA community. In our approach: production rules of a grammar are encode...
متن کاملMildly context sensitive grammar induction and variational bayesian inference
We define a generative model for a minimalist grammar formalism. We present a generalized algorithm for the application of variational bayesian inference to lexicalized mildly context sensitive grammars. We apply this algorithm to the minimalist grammar model.
متن کاملNatural Language Grammar Induction Using a Constituent-Context Model
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according to generative PCFG models. In contrast, we employ a simpler probabilistic model over trees based directly on constituent identity and linear context, and use an EM-like iterative procedure to induce structure. This me...
متن کامل